Enumeration of unrooted maps with given genus
نویسندگان
چکیده
Let Ng(f) denote the number of rooted maps of genus g having f edges. Exact formula for Ng(f) is known for g = 0 (Tutte 1963), g = 1 (Arques 1987), g = 2, 3 (Bender and Canfield 1991). In the present paper we derive an enumeration formula for the number Θγ(e) of unrooted maps on an orientable surface Sγ of given genus γ and given number of edges e. It has a form of a linear combination ∑ i,j ci,jNgj (fi) of numbers of rooted maps Ngj (fi) for some gj ≤ γ and fi ≤ e. The coefficients ci,j are functions of γ and e. Let us consider the quotient Sγ/Z` of Sγ by a cyclic group of automorphisms Z` as a two-dimensional orbifold O. The task to determine ci,j requires to solve the following two subproblems: (a) to compute the number Epio(Γ, Z`) of order preserving epimorphisms from the fundamental group Γ of the orbifold O = Sγ/Z` onto Z`, (b) to calculate the number of rooted maps on the orbifold O which lifts along the branched covering Sγ → Sγ/Z` to maps on Sγ with the given number e of edges. The number Epio(Γ, Z`) is expressed in terms of classical number theoretical functions. The other problem is reduced onto the standard enumeration problem to determine the numbers Ng(f) for some g ≤ γ and f ≤ e. It follows that Θγ(e) can be calculated whenever the numbers Ng(f) are known for g ≤ γ and f ≤ e. In the end of the paper the above approach is applied do derive the functions Θγ(e) explicitly for γ ≤ 3. Let us remark that the function Θγ(e) was known only for γ = 0 (Liskovets 1981). Tables containing the numbers of isomorphism classes of maps up to 30 edges for genus γ = 1, 2, 3 are produced.
منابع مشابه
Enumeration of maps regardless of genus: Geometric approach
We use the conceptual idea of “maps on orbifolds” and the theory of the nonEuclidian crystallographic groups (NEC groups) to enumerate rooted and unrooted maps (both sensed and unsensed) on surfaces regardless of genus. As a consequence we deduce a formula for the number of chiral pairs of maps. The enumeration principle used in this paper is due to A. D. Mednykh (2006), it counts the number of...
متن کاملEnumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
A genus-g map is a 2-cell embedding of a connected graph on a closed, orientable surface of genus g without boundary, that is, a sphere with g handles. Two maps are equivalent if they are related by a homeomorphism between their embedding surfaces that takes the vertices, edges and faces of one map into the vertices, edges and faces, respectively, of the other map, and preserves the orientation...
متن کاملEnumeration of unrooted hypermaps of a given genus
In this paper we derive an enumeration formula for the number of hypermaps of a given genus g and given number of darts n in terms of the numbers of rooted hypermaps of genus γ ≤ g with m darts, where m|n. Explicit expressions for the number of rooted hypermaps of genus g with n darts were derived by Walsh (1975) for g = 0, and by Arques (1987) for g = 1. We apply our general counting formula t...
متن کاملEnumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canfield, 1991). In the present paper we derive an enumeration formula for the number Θγ (e) of unrooted maps on an orientable surface Sγ of a given genus γ and with a given number of edges e. It has a form of a linear com...
متن کاملCounting unrooted hypermaps on closed orientable surface
In this paper we derive an enumeration formula for the number of hypermaps of given genus g and given number of darts n in terms of the numbers of rooted hypermaps of genus γ ≤ g with m darts , where m|n. Résumé. Dans ce travail on denombre les hypergraphes d’un genus g donné, et un nombr e de fleches n, selon le nombre de hyper cartes de genus γ ≤ g, et av ec m fleches, ou m|n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004